LNCS Homepage
CD ContentsAuthor IndexSearch

Analysis of a Parallel MOEA Solving the Multi-objective Quadratic Assignment Problem

Mark P. Kleeman, Richard O. Day, and Gary B. Lamont

Air Force Institute of Technology, Dept of Electrical and Computer Engineering, Graduate School of Engineering & Management, Wright-Patterson AFB (Dayton) OH, 45433, USA
Mark.Kleeman@afit.edu
Richard.Day@afit.edu
Gary.Lamont@afit.edu
http://www.afit.edu

Abstract. The Quadratic Assignment Problem (QAP) is an NP-Complete problem [1]. The multiobjective Quadratic Assignment Problem (mQAP) is the multiobjective version of the QAP and was formalized in 2002 [2]. The QAP has had extensive research, but mQAP research is still in its infancy. The mQAP has been been used to optimize communication for formations of heterogenous unmanned aerial vehicles (UAVs) through the use of the Multi-Objective Messy Genetic Algorithm - II (MOMGA-II) [3]. This research extends that research by using a parallelized version of MOMGA-II and comparing the speedup and efficiency of the parallel results to the serial results.

LNCS 3103, p. 402 f.

Full article in PDF


lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004